|
In mathematics, a group is called boundedly generated if it can be expressed as a finite product of cyclic subgroups. The property of bounded generation is also closely related with the congruence subgroup problem (see ). == Definitions == A group ''G'' is called ''boundedly generated'' if there exists a finite subset ''S'' of ''G'' and a positive integer ''m'' such that every element ''g'' of ''G'' can be represented as a product of at most ''m'' powers of the elements of ''S'': : where and are integers. The finite set ''S'' generates ''G'', so a boundedly generated group is finitely generated. An equivalent definition can be given in terms of cyclic subgroups. A group ''G'' is called ''boundedly generated'' if there is a finite family ''C''1, …, ''C''''M'' of not necessarily distinct cyclic subgroups such that ''G'' = ''C''1…''C''''M'' as a set. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Boundedly generated group」の詳細全文を読む スポンサード リンク
|